Nuprl Lemma : decidable__exists-es-p-local-pred 11,40

es:ES, P:(E), e:E. (e:E. Dec(P(e)))  Dec(a:E. (es-p-local-pred(es;P)(e,a))) 
latex


Definitionse(e1,e2].P(e), e[e1,e2].P(e), e[e1,e2].P(e), e[e1,e2).P(e), e[e1,e2).P(e), ee'.P(e), ee'.P(e), e c e', e loc e' , l_disjoint(T;l1;l2), Outcome, q-rel(r;x), r < s, (xL.P(x)), xLP(x), x f y, a < b, a <p b, a  b, a ~ b, b | a, {i..j}, A  B, a < b, False, x:AB(x), es-p-local-pred(es;P), e<e'.P(e), A c B, x.A(x), e<e'P(e), x(s), {x:AB(x)} , e@iP(e), locl(a), P  Q, P  Q, a = b, x:A.B(x), (x  l), (e < e'), (e <loc e'), kind(e), loc(e), <ab>, loc(e), A, P  Q, t.1, Dec(P), , let x,y = A in B(x;y), E, strong-subtype(A;B), Top, P & Q, constant_function(f;A;B), b, , P  Q, r  s, e < e', val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), , , type List, Msg(M), kindcase(ka.f(a); l,t.g(l;t) ), x,yt(x;y), xt(x), Knd, EState(T), f(a), EOrderAxioms(Epred?info), Id, IdLnk, left + right, Unit, EqDecider(T), Type, x:A  B(x), a:A fp B(a), ES, x:AB(x), x:AB(x), t  T, s = t
Lemmassubtype rel wf, event system wf, deq wf, unit wf, IdLnk wf, Id wf, EOrderAxioms wf, EState wf, Knd wf, kindcase wf, Msg wf, nat wf, rationals wf, val-axiom wf, cless wf, qle wf, bool wf, assert wf, constant function wf, top wf, member wf, es-loc wf, es-locl wf, decidable not, decidable wf, not wf, decidable es-locl, decidable implies better, assert-eq-id, rev implies wf, iff wf, es-E wf, decidable alle-lt, alle-lt wf, decidable cand, decidable existse-before, es-p-local-pred wf

origin